منابع مشابه
Uniquely Localizable Networks with Few Anchors
In the network localization problem the locations of some nodes (called anchors) as well as the distances between some pairs of nodes are known, and the goal is to determine the location of all nodes. The localization problem is said to be solvable (or uniquely localizable) if there is a unique set of locations consistent with the given data. Recent results from graph rigidity theory made it po...
متن کاملA note on uniquely (nil) clean ring
A ring R is uniquely (nil) clean in case for any $a in R$ there exists a uniquely idempotent $ein R$ such that $a-e$ is invertible (nilpotent). Let $C =(A V W B)$ be the Morita Context ring. We determine conditions under which the rings $A,B$ are uniquely (nil) clean. Moreover we show that the center of a uniquely (nil) clean ring is uniquely (nil) clean.
متن کاملEvaluation of postal detection of registrable blindness.
The registration of persons under the National Assistance Act, 1948, entitles them to the social support of the Welfare Department of the local authority and usually to various statutory and other financial benefits and concessions. Its purpose is primarily social and not statistical. The existence of a list of persons suffering from severely restricted vision and having appended diagnoses has ...
متن کاملOn Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms
Uniquely closable skeletons of lambda terms are Motzkin-trees that predetermine the unique closed lambda term that can be obtained by labeling their leaves with de Bruijn indices. Likewise, uniquely typable skeletons of closed lambda terms predetermine the unique simply-typed lambda term that can be obtained by labeling their leaves with de Bruijn indices. We derive, through a sequence of logic...
متن کاملOn uniquely k-determined permutations
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria for a permutation to be uniquely k-determined: one in terms of the distance between two consecutive elements in a permutation, and the other one in terms of directed hamiltonian paths in the certain graphs called path-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Network Science and Engineering
سال: 2020
ISSN: 2327-4697,2334-329X
DOI: 10.1109/tnse.2019.2924638